Capacitated Vehicle Routing and the k-Delivery n-Traveling Salesman Problem

Vehicle routing problems attempt to define optimal delivery methods of goods to places. I examined the capacitated vehicle routing problem that determines the least cost route to deliver objects to customers using a single vehicle of fixed capacity. Vehicle routing problems attract considerable attention because of their implications for delivery businesses. My variant of the problem differs from previous research because there is unequal supply and demand, which increases complexity. I present algorithms for solving the problem and suggest a relationship between my problem and another problem that may be easier to solve.